Graph coloring on coarse grained multicomputers

Graph coloring on coarse grained multicomputers

We present an efficient and scalable Coarse Grained Multicomputer (CGM) coloring algorithm that colors a graph G with at most ∆+1 colors where ∆ is the maximum degree in G. This algorithm is given in two variants: a randomized and a deterministic. We show that on a p-processor CGM model the proposed algorithms require a parallel time of O( |G| p ) and a total work and overall communication cost...

Graph Coloring on a Coarse Grained Multiprocessor

We present the first efficient algorithm for a coarse grained multiprocessor that colors a graph G with a guarantee of at most ∆G +1 colors.

Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP1

In this paper we present deterministic parallel algorithms for the coarse-grained multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following well-known graph problems: (1) list ranking, (2) Euler tour construction in a tree, (3) computing the connected components and spanning forest, (4) lowest common ancestor preprocessing, (5) tree contraction and expression tree...

Strassen’s Algorithm on Coarse Grained Multicomputers

The “standard” naive algorithm for computing the product of two n n × matrices that is typically presented in an introduction to linear algebra runs in ( ) 3 n Θ time on a sequential computer. Strassen [11] developed a recursive algorithm that computes the product of two n n × matrices in ( ) ( ) 81 . 2 7 log2 n O n = Θ sequential time. We present an efficient implementation of Strassen’s algor...

Parallel Range Minima on Coarse Grained Multicomputers